Vehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach

Authors

  • Reza Mahmoudi Department of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran
Abstract:

Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue given in each route is different. In this paper, two distributors has been considered in a city with a set of customers and the best route with maximum revenue has been determined. First we introduced the Hawk-Dove procedure for the VRP problem and then by using Nash bargaining model the equilibrium strategy of the game is calculated. The result of this method is different based on the kind of the strategy that each distributor chooses. In the Hawk-Dove game, if both of distributors choose the Dove procedure, they will get equal but less revenue. In the Nash Bargaining Game, the equilibrium strategy will obtained when distance of revenues of both distributors form its breakdown payoff is maximum.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Distribution Design of Two Rival Decenteralized Supply Chains: a Two-person Nonzero Sum Game Theory Approach

We consider competition between two decentralized supply chains network under demand uncertainty. Each chain consists of one risk-averse manufacturer and a group of risk-averse retailers. These two chains present substitutable products to the geographical dispensed markets. The markets’ demands are contingent upon prices, service levels, and advertising efforts of two supply chains. We formulat...

full text

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

full text

A New Competitive Approach on Multi-Objective Periodic Vehicle Routing Problem

This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...

full text

Stochastic Approach to Vehicle Routing Problem: Development and Theories

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

full text

The Continuous Time Nonzero-Sum Dynkin Game Problem and Application in Game Options

In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we consider the problem of pricing American game contingent claims by the utility maximization approach.

full text

A Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue 2

pages  35- 52

publication date 2017-06-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023